Investigations on grinding process of woven ceramic matrix composite based on reinforced fiber orientations

Fiber orientations play the decisive role in grinding process of woven ceramic matrix composites, but the influence of woven fibers in grinding process is not clear. This paper studies the surface quality and grinding force by comparing different woven surfaces. Through a series of experiments in optimized sampling conditions, we analyze characteristics of the material surface topography height, wave distribution and surface support properties in details. And we find some outstanding characteristics of the surface microstructure. We also study the influence of grinding processing parameters on surface microstructure. The results show that machining surface which contains more parallel fibers is rougher and more keenness than gauss surface. Grinding wheel speed and depth of cut have great influence on surface topography and surface support properties. And it is discovered that grinding forces are also highly dependent on fiber orientations. The mechanism of the grinding phenomena is also analyzed in this paper according to knowledge of fracture mechanics and mechanical damage phenomenology. The research obtained will be an important technical support on improving the processing quality of woven ceramic matrix composites.     

A new reverse reduce-error ensemble pruning algorithm

Although greedy algorithms possess high efficiency, they often receive suboptimal solutions of the ensemble pruning problem, since their exploration areas are limited in large extent. And another marked defect of almost all the currently existing ensemble pruning algorithms, including greedy ones, consists in: they simply abandon all of the classifiers which fail in the competition of ensemble selection, causing a considerable waste of useful resources and information. Inspired by these observations, an interesting greedy Reverse Reduce-Error (RRE) pruning algorithm incorporated with the operation of subtraction is proposed in this work. The RRE algorithm makes the best of the defeated candidate networks in a way that, the Worst Single Model (WSM) is chosen, and then, its votes are subtracted from the votes made by those selected components within the pruned ensemble. The reason is because, for most cases, the WSM might make mistakes in its estimation for the test samples. And, different from the classical RE, the near-optimal solution is produced based on the pruned error of all the available sequential subensembles. Besides, the backfitting step of RE algorithm is replaced with the selection step of a WSM in RRE. Moreover, the problem of ties might be solved more naturally with RRE. Finally, soft voting approach is employed in the testing to RRE algorithm. The performances of RE and RRE algorithms, and two baseline methods, i.e., the method which selects the Best Single Model (BSM) in the initial ensemble, and the method which retains all member networks of the initial ensemble (ALL), are evaluated on seven benchmark classification tasks under different initial ensemble setups. The results of the empirical investigation show the superiority of RRE over the other three ensemble pruning algorithms.     

A modified particle swarm optimization with multiple subpopulations for multimodal function optimization problems

In this paper, a modified particle swarm optimization (PSO) algorithm is developed for solving multimodal function optimization problems. The difference between the proposed method and the general PSO is to split up the original single population into several subpopulations according to the order of particles. The best particle within each subpopulation is recorded and then applied into the velocity updating formula to replace the original global best particle in the whole population. To update all particles in each subpopulation, the modified velocity formula is utilized. Based on the idea of multiple subpopulations, for the multimodal function optimization the several optima including the global and local solutions may probably be found by these best particles separately. To show the efficiency of the proposed method, two kinds of function optimizations are provided, including a single modal function optimization and a complex multimodal function optimization. Simulation results will demonstrate the convergence behavior of particles by the number of iterations, and the global and local system solutions are solved by these best particles of subpopulations.     

New nanocomposite based on poly(lactic-co-glycolic acid) copolymer and magnetite. Synthesis and characterization

The study presents the preparation of the new magnetic nanocomposite based on PLGA and magnetite. The PLGA used to obtain the magnetic nanocomposites was synthesized by the copolymerization of lactic acid with glycolic acid, in the presence of tin octanoate [Sn(Oct)₂] as catalyst, by polycondensation procedure. Magnetite was obtained by co-precipitation from aqueous salt solutions FeCl₂/FeCl₃. The particles size of magnetite was 420 nm, and the saturation magnetization 62.78 emu/g, while the PLGA/magnetite nanocomposite size was 864 nm and the saturation magnetization 39.44 emu/g. The magnetic nanocomposites were characterized by FT-IR, DLS technique, SEM, VSM and simultaneous thermal analyses (TG–FTIR–MS). The polymer matrix PLGA acts as a shell and carrier for the active component, while magnetite is the component which makes targeting possible by external magnetic field manipulation. Based on the gases resulted by thermal degradation of PLGA copolymer, using the simultaneous analysis TG–FTIR–MS, a possible degradation mechanism was proposed.     

Characteristics and formation mechanism of porosities in CFRP during laser joining of CFRP and steel

An experimental investigation on the mechanism of porosity formation during the laser joining of carbon fiber reinforced polymer (CFRP) and steel is presented. The porosity morphology and distribution were characterized by optical and scanning electron microscopy, and the thermal pyrolysis behaviors were investigated by thermal analysis and designed back-side cooling experiments. The results show that there are two types of porosities in CFRP. Porosity I only appears when the heat input is more than 77.8 J/mm. It has a smooth inner wall and distributes near the bonding interface between CFRP and steel at the central area of melted zone, which is caused by gaseous products such as CO₂, NH₃, H₂O, and hydrocarbons produced by the pyrolysis of CFRP. Porosity II can be seen under all joining conditions. It has a rough inner wall and distributes far away from the bonding interface, concentrating at the final solidification locations. Porosity II is caused by the shrinkage of melted CFRP during solidification stage.     

Rapid detection of viable Bacillus cereus emetic and enterotoxic strains in food by coupling propidium monoazide and multiplex PCR (PMA-mPCR)

Bacillus cereus can cause emetic and diarrheal food poisoning. It is widespread in nature and therefore, considered a major foodborne pathogen. To develop a sensitive and reliable assay for detecting enterotoxin genes (nheA, entFM, hblD, cytK) and emetic toxin (ces), specific primers each targeting one individual gene were designed. Propidium monoazide (PMA) was coupled with the developed multiplex PCR (mPCR) for the detection of viable B. cereus. The inclusivity and exclusivity of the PMA-mPCR was confirmed using a panel of 44 strains including 17 emetic and 9 enterotoxic B. cereus reference strains and 18 non-target strains. The limit of detection (LOD) without PMA treatment in pure DNA was 2 pg/reaction tube. The LOD of mPCR assay in pure heat-killed dead bacteria was 4.0 × 10² CFU/mL. Also, the LOD on the viable bacteria with or without PMA treatment was similar (3.8 × 10² CFU/mL) showing that the PMA treatment did not significantly decrease sensitivity. Finally, the newly developed PMA-mPCR successfully detected 4.8 × 10³ and 3.6 × 10³ CFU/g of viable B. cereus F4810/72 (emetic) and B. cereus ATCC 12480 (enterotoxic) reference strains, respectively, in food samples. Hence, this study combines PMA and mPCR to detect viable B. cereus with a wide range of toxin detection (5 toxins). Thus, the novel PMA-mPCR assay developed in this study is a rapid and efficient diagnostic tool for the monitoring of viable B. cereus in food samples and potentially other samples via appropriate DNA extraction.     

Formulation of sage essential oil (Salvia officinalis,L.) monoterpenes into chitosan hydrogels and permeation study with GC-MS analysis

This study deals with the formulation of natural drugs into hydrogels. For the first time, compounds from the sage essential oil were formulated into chitosan hydrogels. A sample preparation procedure for hydrophobic volatile analytes present in a hydrophilic water matrix along with an analytical method based on the gas chromatography coupled with the mass spectrometry (GC-MS) was developed and applied for the evaluation of the identity and quantity of essential oil components in the hydrogels and saline samples. The experimental results revealed that the chitosan hydrogels are suitable for the formulation of sage essential oil. The monoterpene release can be effectively controlled by both chitosan and caffeine concentration in the hydrogels. Permeation experiment, based on a hydrogel with the optimized composition [3.5% (w/w) sage essential oil, 2.0% (w/w) caffeine, 2.5% (w/w) chitosan and 0.1% (w/w) Tween-80] in donor compartment, saline solution in acceptor compartment, and semi-permeable cellophane membrane, demonstrated the useful permeation selectivity. Here, (according to lipophilicity) an enhanced permeation of the bicyclic monoterpenes with antiflogistic and antiseptic properties (eucalyptol, camphor and borneol) and, at the same time, suppressed permeation of toxic thujone (not exceeding its permitted applicable concentration) was observed. These properties highlight the pharmaceutical importance of the developed chitosan hydrogel formulating sage essential oil in the dermal applications.     

Parallel chaos optimization algorithm with migration and merging operation

Chaos optimization algorithm (COA) utilizes the chaotic maps to generate the pseudo-random sequences mapped as the decision variables for global optimization applications. A kind of parallel chaos optimization algorithm (PCOA) has been proposed in our former studies to improve COA. The salient feature of PCOA lies in its pseudo-parallel mechanism. However, all individuals in the PCOA search independently without utilizing the fitness and diversity information of the population. In view of the limitation of PCOA, a novel PCOA with migration and merging operation (denoted as MMO-PCOA) is proposed in this paper. Specifically, parallel individuals are randomly selected to be conducted migration and merging operation with the so far parallel solutions. Both migration and merging operation exchange information within population and produce new candidate individuals, which are different from those generated by stochastic chaotic sequences. Consequently, a good balance between exploration and exploitation can be achieved in the MMO-PCOA. The impacts of different one-dimensional maps and parallel numbers on the MMO-PCOA are also discussed. Benchmark functions and parameter identification problems are used to test the performance of the MMO-PCOA. Simulation results, compared with other optimization algorithms, show the superiority of the proposed MMO-PCOA algorithm.     

Weighted Superposition Attraction (WSA): A swarm intelligence algorithm for optimization problems – Part 2: Constrained optimization

This paper is the second one of the two papers entitled “Weighted Superposition Attraction (WSA) Algorithm”, which is about the performance evaluation of the WSA algorithm in solving the constrained global optimization problems. For this purpose, the well-known mechanical design optimization problems, design of a tension/compression coil spring, design of a pressure vessel, design of a welded beam and design of a speed reducer, are selected as test problems. Since all these problems were formulated as constrained global optimization problems, WSA algorithm requires a constraint handling method for tackling them. For this purpose we have selected 6 formerly developed constraint handling methods for adapting into WSA algorithm and analyze the effect of the used constraint handling method on the performance of the WSA algorithm. In other words, we have the aim of producing concluding remarks over the performance and robustness of the WSA algorithm through a set of computational study in solving the constrained global optimization problems. Computational study indicates the robustness and the effectiveness of the WSA in terms of obtained results, reached level of convergence and the capability of coping with the problems of premature convergence, trapping in a local optima and stagnation.     

An unsupervised approach to generating generic summaries of documents

We present an optimization-based unsupervised approach to automatic document summarization. In the proposed approach, text summarization is modeled as a Boolean programming problem. This model generally attempts to optimize three properties, namely, (1) relevance: summary should contain informative textual units that are relevant to the user; (2) redundancy: summaries should not contain multiple textual units that convey the same information; and (3) length: summary is bounded in length. The approach proposed in this paper is applicable to both tasks: single- and multi-document summarization. In both tasks, documents are split into sentences in preprocessing. We select some salient sentences from document(s) to generate a summary. Finally, the summary is generated by threading all the selected sentences in the order that they appear in the original document(s). We implemented our model on multi-document summarization task. When comparing our methods to several existing summarization methods on an open DUC2005 and DUC2007 data sets, we found that our method improves the summarization results significantly. This is because, first, when extracting summary sentences, this method not only focuses on the relevance scores of sentences to the whole sentence collection, but also the topic representative of sentences. Second, when generating a summary, this method also deals with the problem of repetition of information. The methods were evaluated using ROUGE-1, ROUGE-2 and ROUGE-SU4 metrics. In this paper, we also demonstrate that the summarization result depends on the similarity measure. Results of the experiment showed that combination of symmetric and asymmetric similarity measures yields better result than their use separately.